New Conceptual Handling Systems in Container Terminals
نویسندگان
چکیده
منابع مشابه
Dispatching Vehicles Considering Uncertain Handling times at Port Container Terminals
This paper considers the problem of vehicle dispatching at port container terminals in a dynamic environment. The problem deals with the assignment of delivery orders of containers to vehicles while taking into consideration the uncertainty in the travel times of the vehicles. Thus, a real-time vehicle dispatching algorithm is proposed for adaptation to the dynamic changes in the states of the ...
متن کاملAn Integrated Scheduling Problem of Container Handling Equipment in the Loading Operation at Automated Container Terminals
In automated container terminals, containers are transported between ships and storage yard by differen types of vehicles, for example, guided vehicle (AGV, yard crane (YC) and quay crane (QC). To improve the productivity of the automated container terminals, it is important to harmoniously synchronize operations of different types of container handling equipment. This paper examines the schedu...
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملScheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering and Management Systems
سال: 2012
ISSN: 1598-7248
DOI: 10.7232/iems.2012.11.4.299